keybd INPUT yes screen OUTPUT lf swiss11 on ~%ca0 %ca1 %ca2 %ca3 %ca4 %ca5 %ca6 %ca7 %ca8 %ca9 %caa 1 nolist inptr \n\N yes 1 yes general 0 degrees off 1.23 -3.21 1 -1 6 6 home,home ca0 1 ca1 0 ca2 1 ca3 0 ca4 0 ca5 1 ca6 1 ca7 1 ca8 0 ca9 1 caa 0 cab 0 cac 0 cad 0 cae 0 caf 1 home This web illustrates some behavior of small boolean cellular automata, including the existance of various different limit cycles. Each time the home cell is executed, it sets the initial values of the automaton cells to a different random collection of ones and zeros. Then it causes new values for each automaton cell to be computed from the boolean expression in its script. Recomputation is repeated fifty times, allowing plenty of repetitions for observing the different limit cycles possible with the collection of boolean expressions provided. The current values of the automaton cells ca0, ca1, ca2,... are computed from the previous values of their nearest neighbors (previous values are kept in the cells oc0, oc1, oc2,...) The cell seed contains a seed for the random number generator, and the value of home is used as a general purpose loop index. If you get stuck with the same pattern every time, put a new value into seed. That should break you out of the rut. Try different boolean expressions in the scripts to see how that affects the patterns. To run the demo, execute the script of this home cell. 11 oc0 0 oc1 0 oc2 1 oc3 0 oc4 0 oc5 0 oc6 1 oc7 1 oc8 1 oc9 0 oca 1 ocb 1 occ 1 ocd 0 oce 0 ocf 1 seed This cell is used to seed the random number generator. It is changed by each execution of the home cell. 21